Escaping the Curse of Dimensionality with a Tree-based Regressor
نویسنده
چکیده
We present the first tree-based regressor whose convergence rate depends only on the intrinsic dimension of the data, namely its Assouad dimension. The regressor uses the RPtree partitioning procedure, a simple randomized variant of k-d trees.
منابع مشابه
A tree-based regressor that adapts to intrinsic dimension
We consider the problem of nonparametric regression, consisting of learning an arbitrary mapping f : X → Y from a data set of (x, y) pairs in which the y values are corrupted by noise of mean zero. This statistical task is known to to be subject to a severe curse of dimensionality: if X ⊂ R, and if the only smoothness assumption on f is that it satisfies a Lipschitz condition, it is known that ...
متن کاملFast, smooth and adaptive regression in metric spaces
It was recently shown that certain nonparametric regressors can escape the curse of dimensionality when the intrinsic dimension of data is low ([1, 2]). We prove some stronger results in more general settings. In particular, we consider a regressor which, by combining aspects of both tree-based regression and kernel regression, adapts to intrinsic dimension, operates on general metrics, yields ...
متن کاملA New Indexing Method for High Dimensional Dataset
Indexing high dimensional datasets has attracted extensive attention from many researchers in the last decade. Since R-tree type of index structures are known as suffering “curse of dimensionality” problems, Pyramid-tree type of index structures, which are based on the B-tree, have been proposed to break the curse of dimensionality. However, for high dimensional data, the number of pyramids is ...
متن کاملCEDRIC Research Report n 1049 Back to the curse of dimensionality with local image descriptors
In this report, we are interested in the fast retrieval, in a large collection of points in highdimensional space, of points close to a query point: we want to efficiently find the set of points within a sphere of center query point pi and radius ǫ (a sphere query). It has been argued that beyond a rather small dimension (d ≥ 10) for such sphere queries as well as for other similarity queries, ...
متن کاملIndexing Reduced Dimensionality Spaces Using Single DimensionalIndexesHeng
The dimensionality curse has greatly aaected the scalability of high-dimensional indexes. A well known approach to improving the indexing performance is dimensionality reduction before indexing the data in the reduced-dimensionality space. However, the reduction may cause loss of distance information when the data set is not globally correlated. To reduce loss of information and degradation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009